An Efficient Approach for Association Rule Mining
نویسنده
چکیده
A great research work has been done in last decade in association rules mining (ARM) algorithms . Therefore, various algorithms were proposed to discover frequent item sets and then mine association rules. Apriori algorithm is the most frequently used algorithm for generating association rules. Apriori algorithm has some abuses, such as too many scans of the database, large load of system’s I/O and vast unrelated middle item sets. In this research, we propose a novel association rule mining scheme for discovering frequent itemsets which uses clustering and graph-based approach. This approach scans database only once, and then clusters the transactions according to their length. This approach reduces main memory requirement since it considers only a small cluster at a time and hence it is scalable for any large size of the database. Index Terms Data mining, Apriori , Frequent Itemset, CGAR —————————— ——————————
منابع مشابه
A new approach based on data envelopment analysis with double frontiers for ranking the discovered rules from data mining
Data envelopment analysis (DEA) is a relatively new data oriented approach to evaluate performance of a set of peer entities called decision-making units (DMUs) that convert multiple inputs into multiple outputs. Within a relative limited period, DEA has been converted into a strong quantitative and analytical tool to measure and evaluate performance. In an article written by Toloo et al. (2009...
متن کاملApplying a decision support system for accident analysis by using data mining approach: A case study on one of the Iranian manufactures
Uncertain and stochastic states have been always taken into consideration in the fields of risk management and accident, like other fields of industrial engineering, and have made decision making difficult and complicated for managers in corrective action selection and control measure approach. In this research, huge data sets of the accidents of a manufacturing and industrial unit have been st...
متن کاملOptimizing Membership Functions using Learning Automata for Fuzzy Association Rule Mining
The Transactions in web data often consist of quantitative data, suggesting that fuzzy set theory can be used to represent such data. The time spent by users on each web page is one type of web data, was regarded as a trapezoidal membership function (TMF) and can be used to evaluate user browsing behavior. The quality of mining fuzzy association rules depends on membership functions and since t...
متن کاملIdentifying Important Factors of Arthroplasty in Patients with Degenerative Knee Osteoarthritis Based on Association Rule Mining Approach
Background and Aim: Total Knee Arthroplasty (TKA) aims to reduce the pain and improve the quality of life of patients with progressive osteoarthritis. When the indication of patients' disease is established, this type of surgery should be performed as soon as possible because patients' late attendance increases surgical complications. Therefore, identification of factors influencing the choice ...
متن کاملAssociation Rule Hiding for Data Mining
The best ebooks about Association Rule Hiding For Data Mining that you can get for free here by download this Association Rule Hiding For Data Mining and save to your desktop. This ebooks is under topic such as association rule hiding for data mining springer association rule hiding for data mining advances in association rule hiding knowledge and data engineering an efficient association rule ...
متن کاملAn Efficient Hash-based Association Rule Mining Approach for Document Clustering
Document clustering is one of the important research issues in the field of text mining, where the documents are grouped without predefined categories or labels. High dimensionality is a major challenge in document clustering. Some of the recent algorithms address this problem by using frequent term sets for clustering. This paper proposes a new methodology for document clustering based on Asso...
متن کامل